On S-Regular Prefix-Rewriting Systems and Automatic Structures
نویسنده
چکیده
Underlying the notion of an automatic structure is that of a synchronously regular (s-regular for short) set of pairs of strings. Accordingly we consider s-regular preex-rewriting systems showing that even for fairly restricted systems of this form connu-ence is undecidable in general. Then a close correspondence is established between the existence of an automatic structure that yields a preex-closed set of unique representatives for a nitely generated monoid and the existence of an s-regular canonical preex-rewriting system presenting that monoid.
منابع مشابه
Monoids Presented by Rewriting Systems and Automatic Structures for their Submonoids
This paper studies rr-, lr-, rl-, and ll-automatic structures for finitely generated submonoids of monoids presented by confluent rewriting system that are either finite and special or regular andmonadic. A new technique is developed that uses an automaton to ‘translate’ betweenwords in the original rewriting system andwords over the generators for the submonoid. This is applied to show that th...
متن کاملOn Monoids Presented by Rewriting Systems and Automatic Structures for Their Submonoids
Generalizing results of Otto & Ruškuc, this paper shows that every finitely generated submonoid of a monoid presented by a confluent finite special rewriting system admits an automatic structure that is simultaneously rr-, `r-, r`-, and ``-automatic; and that every finitely generated submonoid of a monoid presented by a confluent regular monadic rewriting system admits an automatic structure th...
متن کاملAlgorithms and Topology of Cayley Graphs for Groups
Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive procedure for constructing van Kampen diagrams with respect to a canonical finite presentation. A comparison with automatic groups is given. Another charact...
متن کاملRewriting Systems with Data A Framework for Reasoning about Systems with Unbounded Structures over Infinite Data Domains
We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constrained rewriting systems on words over an infinite alphabet. We consider several rewriting semantics: factor, prefix, and multiset rewriting. Constraints are expressed in a logic on such words which is parametrized by a first-ord...
متن کاملOn Word Rewriting Systems Having a Rational Derivation
We define four families of word-rewriting systems: the prefix/suffix systems and the left/right systems. The rewriting of prefix systems generalizes the prefix rewriting of systems: a system is prefix (suffix) if a left hand side and a right hand side are overlapping only by prefix (suffix). The rewriting of right systems generalizes the mechanism of transducers: a system is right (left) if a l...
متن کامل